Distance Magic Graphs - a Survey

نویسندگان

  • S. Arumugam
  • Dalibor Froncek
  • N. Kamatchi
چکیده

Let G = (V,E) be a graph of order n. A bijection f : V → {1, 2, . . . , n} is called a distance magic labeling of G if there exists a positive integer k such that ∑ u∈N(v) f(u) = k for all v ∈ V, where N(v) is the open neighborhood of v. The constant k is called the magic constant of the labeling f . Any graph which admits a distance magic labeling is called a distance magic graph. In this paper we present a survey of existing results on distance magic graphs along with our recent results, open problems and conjectures.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

$Z_k$-Magic Labeling of Some Families of Graphs

For any non-trivial abelian group A under addition a graph $G$ is said to be $A$-textit{magic}  if there exists a labeling $f:E(G) rightarrow A-{0}$ such that, the vertex labeling $f^+$  defined as $f^+(v) = sum f(uv)$ taken over all edges $uv$ incident at $v$ is a constant. An $A$-textit{magic} graph $G$ is said to be $Z_k$-magic graph if the group $A$ is $Z_k$  the group of integers modulo $k...

متن کامل

Balanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations

A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...

متن کامل

Distance Magic Labeling and Two Products of Graphs

Let G = (V,E) be a graph of order n. A distance magic labeling of G is a bijection l : V → {1, . . . , n} for which there exists a positive integer k such that ∑ x∈N(v) l(x) = k for all v ∈ V , where N(v) is the neighborhood of v. We introduce a natural subclass of distance magic graphs. For this class we show that it is closed for the direct product with regular graphs and closed as a second f...

متن کامل

A note on 4-regular distance magic graphs

Let G = (V, E) be a graph on n vertices. A bijection f : V → {1, 2, . . . , n} is called a distance magic labeling of G if there exists an integer k such that ∑ u∈N(v) f(u) = k for all v ∈ V , where N(v) is the set of all vertices adjacent to v. The constant k is the magic constant of f and any graph which admits a distance magic labeling is a distance magic graph. In this paper we solve some o...

متن کامل

Totally magic cordial labeling of some graphs

A graph G is said to have a totally magic cordial labeling with constant C if there exists a mapping f : V (G) ∪ E(G) → {0, 1} such that f(a) + f(b) + f(ab) ≡ C (mod 2) for all ab ∈ E(G) and |nf (0) − nf (1)| ≤ 1, where nf (i) (i = 0, 1) is the sum of the number of vertices and edges with label i. In this paper, we give a necessary condition for an odd graph to be not totally magic cordial and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010